Minimum mean cycle problem in bidirected and skew-symmetric graphs
نویسندگان
چکیده
منابع مشابه
Free multiflows in bidirected and skew-symmetric graphs
A graph (digraph) G = (V,E) with a set T ⊆ V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and leaving v are equal). Cherkassky [1] and Lovász [15] showed that the maximum number of pairwise edge-disjoint T -paths in an inner Eulerian graph G is equal to 1 2 ∑ s∈T λ(s), where λ(s) is the minimum number of edges whose remova...
متن کاملBidirected minimum Manhattan network problem
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N (T) of minimum total length with the property that the edges of N (T) are axis-parallel and oriented in a such a way that every ordered pair of terminals is connected in N (T) by a directed Manhattan path. In this paper, we present a polynomial factor 2 approximation ...
متن کاملApproximating the minimum cycle mean
We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible in O(n2) time to the problem of a logarithmic number of min-plus matrix multiplications of n× n-matrices, where n is the...
متن کاملOn flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...
متن کاملThe Generalized Stable Set Problem for Perfect Bidirected Graphs
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we can consider a problem whichi is a natural extension of the maximum weighted stable set problem for undirected graphs. Here we call this problem the generalized stable set problem. It is well known that the maximum weighted stable set problem is solvable in polynomial time for perfect undirected graphs. Perfe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2008.09.005